A Smart Card-Based Mental Poker System
نویسندگان
چکیده
On-line casinos have experienced a great expansion since the generalized use of Internet started. There exist in the literature several proposals of systems allowing secure remote gaming. Nevertheless, the security requirements of some game families lead to the use of complex and costly cryptographic protocols. A particularly challenging game family is mental poker. In this paper we present a smart card-based e-gaming system for mental poker with a low computational cost.
منابع مشابه
Mental Poker Revisited
We discuss how to implement a secure card game without the need for a trusted dealer, a problem often denoted “Mental Poker” in the literature. Our solution requires a broadcast channel between all players and the number of bits needed to represent each card is independent of the number of players. Traditional solutions to “Mental Poker” require a linear relation between the number of players a...
متن کاملA Secure Mental Poker Protocol Over The Internet
An efficient and secure mental poker scheme is proposed in this paper. It is based on multiple encryption and decryption of individual cards. The protocol satisfies all major security requirements of a real mental poker. It gets rid of the Card Salesman and guarantees minimal effect due to collusion of players. The protocol is secure and more efficient compared with other known protocols. The s...
متن کاملDropout-Tolerant TTP-Free Mental Poker
There is a broad literature on distributed card games over communications networks, collectively known as mental poker. Like in any distributed protocol, avoiding the need for a Trusted Third Party (TTP) in mental poker is highly desirable, because really trusted TTPs are not always available and seldom free. This paper deals with the player dropout problem in mental poker without a TTP. A solu...
متن کاملA Reinforcement Learning Agent for 1-Card Poker
Modeling and reasoning about an opponent in a competitive environment is a difficult task. This paper uses a reinforcement learning framework to build an adaptable agent for the game of 1-card poker. The resulting agent is evaluated against various opponents and is shown to be very competitive.
متن کاملBest-response play in partially observable card games
We address the problem of how to play optimally against a fixed opponent in a twoplayer card game with partial information like poker. A game theoretic approach to this problem would specify a pair of stochastic policies that are best-responses to each other, i.e., a Nash equilibrium. Although such a Nash-optimal policy guarantees a lower bound to the attainable payoff against any opponent, it ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006